Building Phylogenetic Trees from Quartets by Using Local Inconsistency Measures
نویسنده
چکیده
A new quartet method is described for building phylogenetic trees, making use of a numerical measure of local inconsistency. For each quartet consisting of four species, the user chooses numbers indicating evidence for each of the three possible completely resolved trees. These numbers may be, for example, tree lengths or likelihoods. From these numbers, I describe how to measure the ‘‘local inconsistency’’ that results from placing a new species into a particular position in a phylogenetic tree. The best placements are those with low local inconsistency. A phylogenetic tree for a collection of taxa may be constructed by picking a random order of species and adding the species in this order, each time using the placement with the lowest local inconsistency. To summarize the results, one may select a majority-rule consensus tree or the tree most frequently obtained. Alternatively, taxa can be added in the order that maximizes the signal strength. Advantages of the method may include flexibility and better resolution. Studies are performed for artificial data sets for which long-branch attractions are a serious problem; comparisons show performance much superior to maximum parsimony and somewhat superior to quartet puzzling. A case study with real data also illustrates the method.
منابع مشابه
Weighted quartets phylogenetics.
Despite impressive technical and theoretical developments, reconstruction of phylogenetic trees for enormous quantities of molecular data is still a challenging task. A key tool in analyses of large data sets has been the construction of separate trees for subsets (e.g., quartets) of sequences, and subsequent combination of these subtrees into a single tree for the full set (i.e., supertree ana...
متن کاملApproximating minimum quartet inconsistency (abstract)
A fundamental problem in computational biology which has been widely studied in the last decades is the reconstruction of evolutionary trees from biological data. Unfortunately, almost all its known formulations are NPhard. The compelling need for having efficient computational tools to solve this biological problem has brought a lot of attention to the analysis of the quartet paradigm for infe...
متن کاملEfficient Quartet Representations of Trees and Applications to Supertree and Summary Methods.
Quartet trees displayed by larger phylogenetic trees have long been used as inputs for species tree and supertree reconstruction. Computational constraints prevent the use of all displayed quartets in many practical problems with large numbers of taxa. We introduce the notion of an Efficient Quartet System (EQS) to represent a phylogenetic tree with a subset of the quartets displayed by the tre...
متن کاملQuartetS: a fast and accurate algorithm for large-scale orthology detection
The unparalleled growth in the availability of genomic data offers both a challenge to develop orthology detection methods that are simultaneously accurate and high throughput and an opportunity to improve orthology detection by leveraging evolutionary evidence in the accumulated sequenced genomes. Here, we report a novel orthology detection method, termed QuartetS, that exploits evolutionary e...
متن کاملReconstructing a level-1-network from quartets
This paper deals with the problem of reconstructing a phylogenetic network from quartets. Specifically a polynomial-time algorithm was implemented to reconstruct trees and level1-networks from quartet data that satisfies certain conditions. This algorithm uses linear algebra methods to construct the set of orders the taxa can have along the boundary when drawing a planar embedding of the networ...
متن کامل